Simultaneous Considering of Machine Availability Constraint, Sequence Dependent Setup Time and Ready Time in a No-wait Hybrid Flow Shop Scheduling Problem to Minimize Mean Tardiness
نویسندگان
چکیده
منابع مشابه
Simultaneous Considering of Machine Availability Constraint, Sequence Dependent Setup Time and Ready Time in a No-wait Hybrid Flow Shop Scheduling Problem to Minimize Mean Tardiness
This paper deal with the problem of no-wait hybrid flow shop which sequence dependent setup times, ready time and machine availability constraint. Minimizing the mean tardiness is considered as the objective to develop the optimal scheduling algorithm. To do so, an efficient hybrid imperialist competitive algorithm (HICA) is proposed to tackle this problem. Our proposed algorithm is compared to...
متن کاملSimultaneous Considering of Machine Availability Constraint, Sequence Dependent Setup Time and Ready Time in a No-wait Hybrid Flow Shop Scheduling Problem to Minimize Mean Tardiness
This paper deal with the problem of no-wait hybrid flow shop which sequence dependent setup times, ready time and machine availability constraint. Minimizing the mean tardiness is considered as the objective to develop the optimal scheduling algorithm. To do so, an efficient hybrid imperialist competitive algorithm (HICA) is proposed to tackle this problem. Our proposed algorithm is compared to...
متن کاملSimultaneous Considering of Machine Availability Constraint, Sequence Dependent Setup Time and Ready Time in a No-wait Hybrid Flow Shop Scheduling Problem to Minimize Mean Tardiness
This paper deal with the problem of no-wait hybrid flow shop which sequence dependent setup times, ready time and machine availability constraint. Minimizing the mean tardiness is considered as the objective to develop the optimal scheduling algorithm. To do so, an efficient hybrid imperialist competitive algorithm (HICA) is proposed to tackle this problem. Our proposed algorithm is compared to...
متن کاملSimultaneous Considering of Machine Availability Constraint, Sequence Dependent Setup Time and Ready Time in a No-wait Hybrid Flow Shop Scheduling Problem to Minimize Mean Tardiness
This paper deal with the problem of no-wait hybrid flow shop which sequence dependent setup times, ready time and machine availability constraint. Minimizing the mean tardiness is considered as the objective to develop the optimal scheduling algorithm. To do so, an efficient hybrid imperialist competitive algorithm (HICA) is proposed to tackle this problem. Our proposed algorithm is compared to...
متن کاملSimultaneous Considering of Machine Availability Constraint, Sequence Dependent Setup Time and Ready Time in a No-wait Hybrid Flow Shop Scheduling Problem to Minimize Mean Tardiness
This paper deal with the problem of no-wait hybrid flow shop which sequence dependent setup times, ready time and machine availability constraint. Minimizing the mean tardiness is considered as the objective to develop the optimal scheduling algorithm. To do so, an efficient hybrid imperialist competitive algorithm (HICA) is proposed to tackle this problem. Our proposed algorithm is compared to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2017
ISSN: 0975-8887
DOI: 10.5120/ijca2017914789